The Implementation of Mazurkiewicz Traces in POEM

We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to store trace systems, which allows sharing common prefixes among traces and therefore, reduces memory cost. This structure is easy to extend to incorporate additional features. Two applications are shown in the paper: An extended structure to support an adequate order for Local First Search, and an acceleration of event zone based state space search for timed automata.